Constructing Piecewise Polynomial Lyapunov Functions Over Arbitrary Convex Polytopes Using Handelman Basis
ثبت نشده
چکیده
We introduce a new algorithm to check the local stability and compute the region of attraction of isolated equilibria of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the polytope into several convex sub-polytopes with a common vertex at the equilibrium. Then, by using Handelman’s theorem, we derive a new set of affine equality and inequality feasibility conditions -solvable by linear programmingon each subpolytope. The solution to this feasibility problem yields a piecewise polynomial Lyapunov function on the entire polytope. To the best of the authors’ knowledge, this is the first effort that utilizes Handelman’s theorem to construct piecewise polynomial Lyapunov functions on sub-divided arbitrary polytopes. In a computational complexity analysis, we show that for large number of states and large degrees of the Lyapunov function, the complexity of the proposed feasibility problem is less than the complexity of the semi-definite programs associated with Sum-of-Squares and Polya’s algorithms. Using different types of convex polytopes, we assess the accuracy of the algorithm in estimating the region of attraction of the equilibrium point of reverse-time Van Der Pol oscillator.
منابع مشابه
Lyapunov Function Synthesis Using Handelman Representations
We investigate linear programming relaxations to synthesize Lyapunov functions that establish the stability of a given system over a bounded region. In particular, we attempt to discover functions that are more readily useful inside symbolic verification tools for proving the correctness of control systems. Our approach searches for a Lyapunov function, given a parametric form with unknown coef...
متن کاملAnalysis of Switched and Hybrid Systems - Beyond Piecewise Quadratic Methods’
This paper presents a method for stability analysis of switched and hybrid systems using polynomial and piecewise polynomial Lyapunov functions. Computation of subh functions can be performed using convex optimization, based on the sum of squares decomposition of multivariate polynomials. The analysis yields several improvements over previous methods and opens up new possibilities, including th...
متن کاملPiecewise Polynomial Functions, Convex Polytopes and Enumerative Geometry
0. Introduction. This paper explores some of the connections between the objects of its title. It is based on a new approach to McMullen’s polytope algebra, and on its relation with equivariant cohomology of toric varieties. In particular, we give another proof of a recent result of Fulton and Sturmfels, which identifies the polytope algebra with the direct limit of all Chow rings of smooth, co...
متن کاملExistence of piecewise linear Lyapunov functions in arbitrary dimensions
Lyapunov functions are an important tool to determine the basin of attraction of exponentially stable equilibria in dynamical systems. In Marinosson (2002), a method to construct Lyapunov functions was presented, using finite differences on finite elements and thus transforming the construction problem into a linear programming problem. In Hafstein (2004), it was shown that this method always s...
متن کاملgH-differentiable of the 2th-order functions interpolating
Fuzzy Hermite interpolation of 5th degree generalizes Lagrange interpolation by fitting a polynomial to a function f that not only interpolates f at each knot but also interpolates two number of consecutive Generalized Hukuhara derivatives of f at each knot. The provided solution for the 5th degree fuzzy Hermite interpolation problem in this paper is based on cardinal basis functions linear com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014